The strong open set condition for self-conformal random fractals

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalence of Positive Hausdorff Measure and the Open Set Condition for Self-conformal Sets

A compact set K is self-conformal if it is a finite union of its images by conformal contractions. It is well known that if the conformal contractions satisfy the “open set condition” (OSC), then K has positive sdimensional Hausdorff measure, where s is the solution of Bowen’s pressure equation. We prove that the OSC, the strong OSC, and positivity of the s-dimensional Hausdorff measure are equ...

متن کامل

Fractals Meet Fractals: Self-Avoiding Random Walks on Percolation Clusters

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our numerical results yield estimates of critical exponents, governing the scaling laws of disorder averages of the co...

متن کامل

Random subsets of self-affine fractals

We find the almost sure Hausdorff and box-counting dimensions of random subsets of self-affine fractals obtained by selecting subsets at each stage of the hierarchical construction in a statistically self-similar manner.

متن کامل

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

15 صفحه اول

Codes, Simplifying Words, and Open Set Condition

In formal language theory the concept of simplifying words is considered in connection with the deciphering delay of codes (cf. BP, Section II.8], LP]). In this paper we show that transferring a deenition from the theory of iterated function systems (IFS) sheds some new light on simplifying words.: Formal languages may be considered as IFS in the Cantor space of innnite strings over a nite alph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2003

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-03-07077-1